Global Stochastic Optimization with Low-Dispersion Point Sets
نویسندگان
چکیده
This study concerns a generic model-free stochastic optimization problem requiring the minimization of a risk function de%ned on a given bounded domain in a Euclidean space. Smoothness assumptions regarding the risk function are hypothesized, and members of the underlying space of probabilities are presumed subject to a large deviation principle; however, the risk function may well be nonconvex and multimodal. A general approach to %nding the risk minimizer on the basis of decision=observation pairs is proposed. It consists of repeatedly observing pairs over a collection of design points. Principles are derived for choosing the number of these design points on the basis of an observation budget, and for allocating the observations between these points in both prescheduled and adaptive settings. On the basis of these principles, large-deviation type bounds of the minimizer in terms of sample size are established.
منابع مشابه
SOAR: Stochastic Optimization for Affine global point set Registration
We introduce a stochastic algorithm for pairwise affine registration of partially overlapping 3D point clouds with unknown point correspondences. The algorithm recovers the globally optimal scale, rotation, and translation alignment parameters and is applicable in a variety of difficult settings, including very sparse, noisy, and outlierridden datasets that do not permit the computation of loca...
متن کاملGunter Rote And
Quasi-Monte-Carlo methods are well-known for solving di erent problems of numerical analysis such as integration, optimization, etc. The error estimates for global optimization depend on the dispersion of the point sequence with respect to balls. In general, the dispersion of a point set with respect to various classes of range spaces, like balls, squares, triangles, axis-parallel and arbitrary...
متن کاملStochastic Optimization for Rigid Point Set Registration
In this paper we propose a new method for pairwise rigid point set registration. We pay special attention to noise robustness, outlier resistance and global optimal alignment. The problem of registering two point clouds in space is converted to a minimization of a nonlinear cost function. We propose a cost function that aims to reduce the impact of noise and outliers. Its definition is based on...
متن کاملAlgorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
DRAFT OF A PAPER PUBLISHED IN EA’2005 : Anne Auger, Mohamed Jebalia, Olivier Teytaud. (X,sigma,eta) : quasi-random mutations for Evolution Strategies. Proceedings of Evolutionary Algorihtms’2005, 12 pages. Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic aspect of evolution...
متن کاملNon-linear stochastic inversion of regional Bouguer anomalies by means of Particle Swarm Optimization: Application to the Zagros Mountains
Estimating the lateral depth variations of the Earth’s crust from gravity data is a non-linear ill-posed problem. The ill-posedness of the problem is due to the presence of noise in the data, and also the non-uniqueness of the problem. Particle Swarm Optimization (PSO) is a stochastic population-based optimizer, originally inspired by the social behavior of fish schools and bird flocks. PSO is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Operations Research
دوره 48 شماره
صفحات -
تاریخ انتشار 2000